Numerical reckoning fixed points via new faster iteration process

In this paper, we propose a new iteration process which is faster than the leading S [J. Nonlinear Convex Anal. 8, no. 1 (2007), 61-79], Thakur et al. [App. Math. Comp. 275 (2016), 147-155] and M [Filomat 32, (2018), 187-196] iterations for numerical reckoning fixed points. Using process, some point convergence results generalized α-nonexpansive mappings in setting of uniformly convex Banach spaces are proved. At end offer example to compare rate proposed with processes.